An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree
نویسندگان
چکیده
We show that the minmax regret median of a tree can be found in O(n log n) time. This is obtained by a modification of Averbakh and Berman’s O(n log n)-time algorithm: We design a dynamic solution to their bottleneck subproblem of finding the middle of every root-leaf path in a tree.
منابع مشابه
[11] A. Ben-Tal and A. Nemirovski. Robust solutions of uncertain linear
[4] Igor Averbakh. Minmax regret solutions for minmax optimization problems with uncertainty. [5] Igor Averbakh. On the complexity of a class of combinatorial optimization problems with uncertainty. [7] Igor Averbakh and Oded Berman. Minimax regret p-center location on a network with demand uncertainty. [8] Igor Averbakh and Oded Berman. Minmax p-traveling salesman location problems on a tree.
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملImproved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
In a recent paper [10], an algorithmic approach was presented for the robust (minmax regret) absolute deviation location problem on networks with vertex weights which are linear functions of an uncertain or dynamically changing parameter. In this paper, we present algorithmic and analytical improvements that significantly reduce the computational complexity bounds for the algorithm.
متن کاملA Robust Feedforward Active Noise Control System with a Variable Step-Size FxLMS Algorithm: Designing a New Online Secondary Path Modelling Method
Several approaches have been introduced in literature for active noise control (ANC)systems. Since Filtered-x-Least Mean Square (FxLMS) algorithm appears to be the best choice as acontroller filter. Researchers tend to improve performance of ANC systems by enhancing andmodifying this algorithm. This paper proposes a new version of FxLMS algorithm. In many ANCapplications an online secondary pat...
متن کاملINFORMATIK Sequential and parallel algori thms for the k closest pairs problem
Let S be a set of n points in D-dimensional space, where D is a constant, and let k be an integer between 1 and (~). A new and simpler proof is given of Salowe's theorem, i.e., a sequential algorithmis given that computes the k c10sest pairs in the set S in O(nlogn + k) time, using O(n + k) space. The algorithm fits in the algebraic decision tree model and is, therefore, optimal. Salowe's algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008